Coloring large complex networks
نویسندگان
چکیده
منابع مشابه
Coloring Random Intersection Graphs and Complex Networks
Random intersection graphs naturally exhibit a certain amount of transitivity and hence can be used to model real–world networks. We study the evolution of the chromatic number of a random intersection graph and show that, in a certain range of parameters, these random graphs can be coloured optimally with high probability using different greedy algorithms. Experiments on real network data conf...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملIdentifying effective multiple spreaders by coloring complex networks
How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an attempt to find effective multiple spreaders in complex networks by generalizing the idea of the coloring problem in graph theory to complex networks. In our me...
متن کاملlpkp: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
0
متن کاملThe Coloring Ideal and Coloring Complex of a Graph
Let G be a simple graph on d vertices. We define a monomial ideal K in the Stanley-Reisner ring A of the order complex of the Boolean algebra on d atoms. The monomials in K are in one-to-one correspondence with the proper colorings of G. In particular, the Hilbert polynomial of K equals the chromatic polynomial of G. The ideal K is generated by square-free monomials, so A/K is the Stanley-Reisn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Network Analysis and Mining
سال: 2014
ISSN: 1869-5450,1869-5469
DOI: 10.1007/s13278-014-0228-y